Simultaneous Search and Recruitment∗
نویسنده
چکیده
I present an equilibrium search model of the labor market in which workers send multiple applications and firms can interview multiple applicants. The potential number of interviews is determined by an ex ante investment in a recruitment technology. A better technology is more costly, but serves two purposes: it increases the probability that the firm will identify an applicant that is qualified for the job, and it allows the firm to make new job offers, in case earlier offers got rejected by the workers. I characterize the equilibrium and argue that many existing models are incorporated as special cases, including the standard directed search model with one application and one job offer and the stable matching outcome. Therefore, structural estimation of the the model can indicate how large the inefficiencies in the decentralized labor market are and what the potential gains from labor market policy are. Moreover, the estimation can shed light on the question whether ex ante frictions (i.e. on the worker side) or ex post frictions (i.e. on the firm side) contribute more to the output loss compared to the frictionless Walrasian world.
منابع مشابه
SIMULTANEOUS ANALYSIS, DESIGN AND OPTIMIZATION OF WATER DISTRIBUTION SYSTEMS USING SUPERVISED CHARGED SYSTEM SEARCH
The present study encompasses a new method to simultaneous analysis, design and optimization of Water Distribution Systems (WDSs). In this method, analysis procedure is carried out using Charged System Search (CSS) optimization algorithm. Besides design and cost optimization of WDSs are performed simultaneous with analysis process using a new objective function in order to satisfying the analys...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملSimultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts
Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...
متن کاملCONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD
Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کامل